Likelihood Ratio Tests for a Large Directed Acyclic Graph

Instrumental variable tests for Directed Acyclic Graph Models

Likelihood Ratio Tests for

Analyzing Directed Acyclic Graph Recombination

This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described. As an experimental analysis indicates, a recombination operato...

Directed Acyclic Subsequence Graph for multiple texts

The subsequence matching problem is to decide, for given strings S and T , whether S is a subsequence of T. The string S is called pattern and the string T text. We consider the case of multiple texts and show how to solve the subsequence matching problem in time linear in the length of pattern. For this purpose we build the automaton that accepts all subsequences of given texts. The automaton ...

On likelihood ratio tests

Likelihood ratio tests are intuitively appealing. Nevertheless, a number of examples are known in which they perform very poorly. The present paper discusses a large class of situations in which this is the case, and analyzes just how intuition misleads us; it also presents an alternative approach which in these situations is optimal. 1. The popularity of likelihood ratio tests Faced with a new...